computational complexity theory

Results: 2049



#Item
821Computational Extractors and Pseudorandomness Dana Dachman-Soled ∗  Rosario Gennaro†

Computational Extractors and Pseudorandomness Dana Dachman-Soled ∗ Rosario Gennaro†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2011-12-28 18:41:58
822Chennai Mathematical Institute MSc/PhD Computer Science Topics covered in entrance examination • Discrete Mathematics Sets and relations, elementary counting techiniques, pigeon hole principle, partial orders, • Elem

Chennai Mathematical Institute MSc/PhD Computer Science Topics covered in entrance examination • Discrete Mathematics Sets and relations, elementary counting techiniques, pigeon hole principle, partial orders, • Elem

Add to Reading List

Source URL: www.cmi.ac.in

Language: English - Date: 2010-03-23 06:34:16
823Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data∗ Yevgeniy Dodis† Rafail Ostrovsky‡

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data∗ Yevgeniy Dodis† Rafail Ostrovsky‡

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2008-04-01 12:50:42
824CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 25 May 2012 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10

CHENNAI MATHEMATICAL INSTITUTE M.Sc. / Ph.D. Programme in Computer Science Entrance Examination, 25 May 2012 This question paper has 5 printed sides. Part A has 10 questions of 3 marks each. Part B has 7 questions of 10

Add to Reading List

Source URL: www.cmi.ac.in

Language: English - Date: 2013-02-28 10:49:50
825Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010  Abstract

Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-06-09 14:57:08
826On the Security of Hash Functions Employing Blockcipher Postprocessing Donghoon Chang1 , Mridul Nandi2 , and Moti Yung3 1  3

On the Security of Hash Functions Employing Blockcipher Postprocessing Donghoon Chang1 , Mridul Nandi2 , and Moti Yung3 1 3

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-12-10 07:46:56
827How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗

How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-05-01 02:12:54
828Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT

Succinct Non-Interactive Arguments via Linear Interactive Proofs Nir Bitansky∗ Tel Aviv University Alessandro Chiesa MIT

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2013-09-15 12:03:01
829Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U)

Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U)

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2009-02-23 00:05:29
830Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets Yevgeniy Dodis∗ Daniel Wichs†

Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets Yevgeniy Dodis∗ Daniel Wichs†

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-04-05 17:10:39